Bias factor method using random sampling technique
نویسندگان
چکیده
منابع مشابه
Stein’s Method and the Zero Bias Transformation with Application to Simple Random Sampling
Let W be a random variable with mean zero and variance σ2. The distribution of a variate W , satisfying EWf(W ) = σ2Ef (W ) for smooth functions f , exists uniquely and defines the zero bias transformation on the distribution of W . The zero bias transformation shares many interesting properties with the well known size bias transformation for non-negative variables, but is applied to variables...
متن کاملA Random Walk Method Using Trust Factor in Collaborative Filtering
Collaborative filtering is one of the most widely used techniques for recommendation system which has been successfully applied in many applications. However, it suffers from the cold start users who rate only a small fraction of the available items. In addition, these methods can not indicate confidence they are for recommendation. Trust-based recommendation methods assume the additional knowl...
متن کاملThe Efficiency of the HyperPlay Technique Over Random Sampling
We show that the HyperPlay technique, which maintains a bag of updatable models for sampling an imperfect-information game, is more efficient than taking random samples of play sequences. Also, we demonstrate that random sampling may become impossible under the practical constraints of a game. We show the HyperPlay sample can become biased and not uniformly distributed across an information set...
متن کاملA Random Sampling Technique for Training Support Vector Machines
Random sampling techniques have been developed for combinatorial optimization problems. In this note, we report an application of one of these techniques for training support vector machines (more precisely, primal-form maximal-margin classifiers) that solve two-group classification problems by using hyperplane classifiers. Through this research, we are aiming (I) to design efficient and theore...
متن کاملSelective Sampling Using Random Field Modelling
Most existing inductive learning algorithms assume the availability of a training set of labeled examples. In many domains, however, labeling the examples is a costly process that requires either intensive computation or manual labor. In such cases, it may be beneecial for the learner to be active by intelligent selection of examples for labeling with the goal of reducing the labeling cost. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nuclear Science and Technology
سال: 2016
ISSN: 0022-3131,1881-1248
DOI: 10.1080/00223131.2015.1126541